Low rank matrix approximations appear in a number of scientific computing applications. We consider the Nystr\"{o}m method for approximating a positive semidefinite matrix $A$. The computational cost of its single-pass version can be decreased by running it in mixed precision, where the expensive products with $A$ are computed in a precision lower than the working precision. We bound the extra finite precision error which is compared to the error of the Nystr\"{o}m approximation in exact arithmetic and develop a heuristic to identify when the approximation quality is not affected by the low precision computation. Further, the mixed precision Nystr\"{o}m method can be used to inexpensively construct a limited memory preconditioner for the co...
We study a relaxed version of the column-sampling problem for the Nyström approximation of kernel m...
The largest dense linear systems that are being solved today are of order $n = 10^7$. Single precis...
This paper develops a suite of algorithms for constructing low-rank approximations of an input matri...
The available error bounds for randomized algorithms for computing a low rank approximation to a ma...
Motivated by the demand in machine learning, modern computer hardware is increas- ingly supporting r...
We present a new mixed precision algorithm to compute low-rank matrix and tensor approximations, a f...
Today's floating-point arithmetic landscape is broader than ever. While scientific computing has tra...
We introduce a novel approach to exploit mixed precision arithmetic for low-rank approximations. Our...
This work is concerned with computing low-rank approximations of a matrix function $f(A)$ for a larg...
The CUR matrix decomposition and the Nyström approximation are two important low-rank matrix approx...
Traditional optimization methods rely on the use of single-precision floating point arithmetic, whic...
It is well established that mixed precision algorithms that factorize a matrix at a precision lower...
Positive semidefinite matrices arise in a variety of fields, including statistics, signal processing...
Low-rank matrix approximation is an effective tool in alleviating the memory and computational burde...
Low-precision arithmetic has had a transformative effect on the training of neural networks, reducin...
We study a relaxed version of the column-sampling problem for the Nyström approximation of kernel m...
The largest dense linear systems that are being solved today are of order $n = 10^7$. Single precis...
This paper develops a suite of algorithms for constructing low-rank approximations of an input matri...
The available error bounds for randomized algorithms for computing a low rank approximation to a ma...
Motivated by the demand in machine learning, modern computer hardware is increas- ingly supporting r...
We present a new mixed precision algorithm to compute low-rank matrix and tensor approximations, a f...
Today's floating-point arithmetic landscape is broader than ever. While scientific computing has tra...
We introduce a novel approach to exploit mixed precision arithmetic for low-rank approximations. Our...
This work is concerned with computing low-rank approximations of a matrix function $f(A)$ for a larg...
The CUR matrix decomposition and the Nyström approximation are two important low-rank matrix approx...
Traditional optimization methods rely on the use of single-precision floating point arithmetic, whic...
It is well established that mixed precision algorithms that factorize a matrix at a precision lower...
Positive semidefinite matrices arise in a variety of fields, including statistics, signal processing...
Low-rank matrix approximation is an effective tool in alleviating the memory and computational burde...
Low-precision arithmetic has had a transformative effect on the training of neural networks, reducin...
We study a relaxed version of the column-sampling problem for the Nyström approximation of kernel m...
The largest dense linear systems that are being solved today are of order $n = 10^7$. Single precis...
This paper develops a suite of algorithms for constructing low-rank approximations of an input matri...